|
In circuit complexity, AC is a complexity class hierarchy. Each class, ACi, consists of the languages recognized by Boolean circuits with depth and a polynomial number of unlimited fan-in AND and OR gates. The name "AC" was chosen by analogy to NC, with the "A" in the name standing for "alternating" and referring both to the alternation between the AND and OR gates in the circuits and to alternating Turing machines.〔, page 27-18.〕 The smallest AC class is AC0, consisting of constant-depth unlimited fan-in circuits. The total hierarchy of AC classes is defined as ==Relation to NC== The AC classes are related to the NC classes, which are defined similarly, but with gates having only constant fanin. For each ''i'', we have : As an immediate consequence of this, we have that NC = AC. It is known that inclusion is strict for ''i'' = 0.〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「AC (complexity)」の詳細全文を読む スポンサード リンク
|